OLAPS: Online load-balancing in range-partitioned main memory database with approximate partition statistics
نویسندگان
چکیده
منابع مشابه
Load Balancing with Memory
A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar perform...
متن کاملOnline Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale parallel databases, as well as in peer-to-peer (P2P) systems. As tuples are inserted and deleted, the partitions may need to be adjusted, and data moved, in order to achieve storage balance across the p...
متن کاملA simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
Random hashing is a standard method to balance loads among nodes in Peer-to-Peer networks. However, hashing destroys locality properties of object keys, the critical properties to many applications, more specifically, those that require range searching. To preserve a key order while keeping loads balanced, Ganesan, Bawa and Garcia-Molina proposed a load-balancing algorithm that supports both ob...
متن کاملDynamic Load Balancing with theRe nement - Tree Partition
Dynamic load balancing is considered in the context of adaptive multilevel methods for partial diierential equations on networks of workstations or PCs. An approach that periodically repartitions the grid is taken. A partitioning algorithm based on the reenement tree of the adaptive grid is presented and analyzed in terms of the most important properties of grid partitioners.
متن کاملDynamic Load Balancing in Parallel Database Systems
Parallel database systems have to support both inter-transaction as well as intra-transaction parallelism. Inter-transaction parallelism (multi-user mode) is required to achieve high throughput, in particular for OLTP transactions, and sufficient cost-effectiveness. Intratransaction parallelism is a prerequisite for reducing the response time of complex and dataintensive transactions (queries)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2018
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis170320007b